Efficient remainder rule

Understanding the solution of a problem may require the reader to have background knowledge on the subject. For instance, finding an integer which, when divided by a nonzero integer leaves a remainder; but when divided by another nonzero integer may leave a different remainder. To find a smallest positive integer or a set of integers following the given conditions, one may need to understand the concept of modulo arithmetic in number theory. The Chinese Remainder Theorem is a known method to solve these types of problems using modulo arithmetic. In this paper, an efficient remainder rule has been proposed based on basic mathematical concepts. These core concepts are as follows: basic remainder rules of divisions, linear equation in slope intercept form, arithmetic progression and the use of a graphing calculator. These are easily understood by students who have taken prealgebra or intermediate algebra.     

On Cartan's theorem for linear operators

In this paper, we describe a second main theorem of holomorphic curves in , of hyper‐order strictly less than 1, that involves a general linear operator . As an application, we derive a truncated second main theorem of degenerate holomorphic curves of hyper‐order strictly less than 1 using Nochka weights.     

On separating a fixed point from zero by invariants

Assume a fixed point v∈V^G can be separated from zero by a homogeneous invariant f∈𝕜[V]^G of degree p^rd, where p>0 is the characteristic of the ground field 𝕜 and p,d are coprime. We show that then v can also be separated from zero by an invariant of degree p^r, which we obtain explicitly from f. It follows that the minimal degree of a homogeneous invariant separating v from zero is a p-power.     

Hölder Continuity of the Saddle Point Set for Real-Valued Functions

This paper is concerned with Hölder continuity of the solution to a saddle point problem. Some new su?cient conditions for the uniqueness and Hölder continuity of the solution for a perturbed saddle point problem are established. Applications of the result on Hölder continuity of the solution for perturbed constrained optimization problems are presented under mild conditions. Examples are given to illustrate the obtained results.     

Nonmonotone Inexact Newton Method for the Extended Linear Complementarity Problem

This paper presents a nonmonotone inexact Newton-type method for the extended linear complementarity problem (ELCP). We first reformulate the optimization system of the ELCP problem into a system of smoothed equations. Then we solve this system by a nonmonotone inexact Newton-type algorithm. The global convergence is obtained and numerical tests for some classes of ELCP include linear complementarity, horizontal linear complementarity, and generalized linear complementarity problems are also given to show the e?ciency of the proposed algorithm.     

Central Schur rings over the projective special linear groups

In [1 Bannai, E. (1991). Subschemes of some association schemes. J. Algebra 14:167–188.[Crossref], [Web of Science ®] , [Google Scholar]], Bannai presents a fusion condition and uses this to consider central Schur rings (S-rings) over the simple groups PSL(2,q) where q is a prime power. In this paper, we concretely describe all such S-rings in terms of symmetric S-rings over cyclic groups. The final section discusses counting these.     

Well‐posedness of initial boundary value problems on longitudinal impact on a composite linear viscoelastic bar

We investigate the correctness of the initial boundary value problem of longitudinal impact on a piecewise‐homogeneous semi‐infinite bar consisting of a semi‐infinite elastic part and finite length visco‐elastic part whose hereditary properties are described by linear integral relations with an arbitrary difference kernel. Introducing nonstationary regularization in boundary conditions and in the contact conditions, the well‐posedness of the considered problem is proved. Copyright © 2017 John Wiley & Sons, Ltd.     

Synchronization of complex networks with time‐varying inner coupling and outer coupling matrices

Synchronization of complex networks with time‐varying coupling matrices is studied in this paper. Two kinds of time‐varying coupling are taken into account. One is the time‐varying inner coupling in the node state space and the other is the time‐varying outer coupling in the network topology space. By respectively setting linear controllers and adaptive controllers, time‐varying complex networks can be synchronized to a desired state. Meanwhile, different influences of the control parameters of linear controllers and adaptive controllers on the synchronization have also been investigated. Based on the Lyapunov function theory, we construct appropriate positive‐definite functions, and several sufficient synchronization criteria are obtained. Numerical simulations further illustrate the effectiveness of conclusions. Copyright © 2017 John Wiley & Sons, Ltd.